Universal Chosen-Ciphertext Attack for a Family of Image Encryption Schemes

In recent decades, there has been considerable popularity in employing nonlinear dynamics and permutation-substitution structures for image encryption. Three procedures generally exist such encryption schemes: the key schedule module producing elements, permutation scrambling substitution pixel modification. This paper cryptanalyzes a family of schemes that adopt pixel-level modular addition-based substitution. The security analysis first reveals common defect studied schemes. Specifically, mapping from differentials ciphertexts to those plaintexts is found be linear independent schedules, techniques rounds. On this theory basis, universal chosen-ciphertext attack further proposed. Experimental results demonstrate proposed can recover without or any elements. Related cryptographic discussions are also given.